Dynamic reasoning with qualified syllogisms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Reasoning with Qualified Syllogisms

A gualij%e~ syllogism is a classical Aristoteiean syllogism that has been “qualified” through the use of fuzzy quantifiers, likelihood modifiers, and usuality modifiers, e.g., “Most birds can Ry; Tweety is a bird; therefore, it is likely that Tweety can fly.” This paper introduces a formal logic Q of such syllogisms and shows how this may be employed in a system of nonmonotonj~ reasoning. In pr...

متن کامل

A Computational Logic Approach to Syllogisms in Human Reasoning

Abstract. Psychological experiments on syllogistic reasoning have shown that participants did not always deduce the classical logically valid conclusions. In particular, the results show that they had di culties to reason with syllogistic statements that contradicted their own beliefs. This paper discusses syllogisms in human reasoning and proposes a formalization under the weak completion sema...

متن کامل

Optimizing Reasoning in Description Logics with Qualified Number Restrictions

In this extended abstract an optimization technique, the so-called signature calculus, for reasoning with number restrictions in description logics is investigated. The calculus is used to speed-up ABox (and TBox) reasoning in the description logic ALCQHR+ .

متن کامل

Optimizing Reasoning with Qualified Number Restrictions in SHQ

1 Introduction Using SHQ one can express number restrictions on role fillers of individuals. A typical question for a DL reasoner would be whether the concept ∀hasCredit. test the satisfiability of such a concept by first satisfying all at-least restrictions, e.g., by creating 260 hasCredit-fillers, of which 120 are instances of (Science Engineering). Eventually, a nondetermin-istic choose-rule...

متن کامل

Automated Reasoning on TBoxes with Qualified Number Restrictions via SMT

The problem of reasoning with quali ed number restrictions in Description Logics (DLs) has been investigated since the very rst research steps in automated reasoning for DLs. Moreover, developing techniques for optimized reasoning with quali ed number restrictions and has gained further importance since quali ed number restrictions have been added to the forthcoming standard OWL 2 for Semantic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 1997

ISSN: 0004-3702

DOI: 10.1016/s0004-3702(97)00020-9